The Class of Series – Parallel Graphs. Part I
نویسنده
چکیده
We adopt the following rules: n is a natural number and x1, x2, x3, x4, x5, y1, y2, y3 are sets. Let x1, x2, x3, x4, x5 be sets. We say that x1, x2, x3, x4, x5 are mutually different if and only if: (Def. 1) x1 6= x2 and x1 6= x3 and x1 6= x4 and x1 6= x5 and x2 6= x3 and x2 6= x4 and x2 6= x5 and x3 6= x4 and x3 6= x5 and x4 6= x5. Next we state several propositions: (1) If x1, x2, x3, x4, x5 are mutually different, then card{x1, x2, x3, x4, x5} = 5. (2) 4 = {0, 1, 2, 3}. (3) [: {x1, x2, x3}, {y1, y2, y3} :] = {〈x1, y1〉, 〈x1, y2〉, 〈x1, y3〉, 〈x2, y1〉, 〈x2, y2〉, 〈x2, y3〉, 〈x3, y1〉, 〈x3, y2〉, 〈x3, y3〉}. (4) For every set x and for every natural number n such that x ∈ n holds x is a natural number.
منابع مشابه
The Class of Series - Parallel Graphs . Part II 1 Krzysztof Retel University of Białystok
In this paper we introduce two new operations on graphs: sum and union corresponding to parallel and series operation respectively. We determine N-free graph as the graph that does not embed Necklace 4. We define “fin RelStr” as the set of all graphs with finite carriers. We also define the smallest class of graphs which contains the one-element graph and which is closed under parallel and seri...
متن کاملThe Class of Series-Parallel Graphs. Part II
In this paper we introduce two new operations on graphs: sum and union corresponding to parallel and series operation respectively. We determine N -free graph as the graph that does not embed Necklace 4. We define “fin RelStr” as the set of all graphs with finite carriers. We also define the smallest class of graphs which contains the one-element graph and which is closed under parallel and ser...
متن کاملA special Class of Stochastic PERT Networks
Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure. In series-parallel SPN, the completion time distribution f...
متن کاملA special Class of Stochastic PERT Networks
Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure.
In series-parallel SPN, the completion time distribution...
متن کاملCombinatorial problems on series-parallel graphs
We show, in a unified manner, that there exist linear time algorithms for many combinatorial problems defined on the class of series-parallel graphs. These include (i) the decision problem, and (ii) the minimum edge (vertex) deletion problem both with respect to a property characterized by a finite number of forbidden graphs, and (iii) the generalized matching problem.
متن کاملComparison between four dissimilar solar panel configurations
Several studies on photovoltaic systems focused on how it operates and energy required in operating it. Little attention is paid on its configurations, modeling of mean time to system failure, availability, cost benefit and comparisons of parallel and series–parallel designs. In this research work, four system configurations were studied. Configuration I consists of two sub-components arranged ...
متن کامل